首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   209篇
  免费   30篇
  2021年   2篇
  2019年   8篇
  2018年   4篇
  2017年   5篇
  2016年   13篇
  2015年   14篇
  2014年   9篇
  2013年   59篇
  2012年   9篇
  2011年   7篇
  2010年   5篇
  2009年   7篇
  2008年   9篇
  2007年   12篇
  2006年   8篇
  2005年   12篇
  2004年   10篇
  2003年   13篇
  2002年   10篇
  2001年   6篇
  2000年   5篇
  1999年   7篇
  1995年   1篇
  1993年   1篇
  1985年   2篇
  1981年   1篇
排序方式: 共有239条查询结果,搜索用时 281 毫秒
71.
This paper presents a simple model to characterize the outcome of a land dispute between two rival parties using a Stackelberg game. Unlike Gershenson and Grossman (2000 Gershenson, D. and Grossman, H.I. 2000. Civil conflict: ended or never ending?. Journal of Conflict Resolution, 44(6): 807821.  [Google Scholar]), we assume that the opposing parties have access to different technologies for challenging and defending in conflict. We derive the conditions under which territorial conflict between the two parties is less likely to persist indefinitely. Allowing for an exogenous destruction term as in Garfinkel and Skaperdas (2000 Garfinkel, M. and Skaperdas, S. 2000. Conflict without misperceptions or incomplete information: how the future matters. Journal of Conflict Resolution, 44(6): 793807. [Crossref], [Web of Science ®] [Google Scholar]), we show that, when the nature of conflict becomes more destructive, the likelihood of a peaceful outcome, in which the territory’s initial possessor deters the challenging party, increases if the initial possessor holds more intrinsic value for the disputed land. Following Siqueira (2003 Siqueira, K. 2003. Conflict and third‐party intervention. Defence and Peace Economics, 14(6): 389400. [Taylor & Francis Online], [Web of Science ®] [Google Scholar]), our model has policy implications for peace through third‐party intervention.  相似文献   
72.
73.
74.
75.
Book reviews     
Frank Zimmer, Bismarcks Kampf gegen Kaiser Franz Joseph Konigsgratz und seine Folgen. Graz, Vienna, Cologne: Styria Verlag 1996. Pp.203,49 illus., 1 map. OS 350/DM 49. ISBN 3–222–12377–2.

Saul Zadka, Blood in Zion: How the Jewish Guerrillas drove the British out of Palestine. London and Washington: Brassey's, 1995. Pp.227, chron., illus., index. £19.95. ISBN 1–85753–136–1.

Theodore L. Gatchel, At the Water's Edge: Defending against the Modern Amphibious Assault. Annapolis, MD: Naval Institute Press, 1996. Pp.xvi+217, notes, biblio, index. $36.95. ISBN 1–55750–308–7.

Max G. Manwaring and William J. Olson (eds.) Managing Contemporary Conflict: Pillars of Success. Boulder, CO: Westview Press, 1996. Pp.269, no index. $65 (cloth); $25 (paper). ISBN 0–8133–8969 and 9978–5

Chris Seiple, The US Military/NGO Relationship in Humanitarian Interventions, Carlisle Barracks, PA: The

Richard L. Millett and Michael Gold‐Biss (eds.) Beyond Praetorianism: The Latin American Military in Transition. University of Miami: North/South Center Press; Boulder, CO: Lynne Rienner, 1996. Pp.xv +317, index. $24.95. ISBN 1–5745–000–9.

Rudolph C. Barnes Jr, Military Legitimacy: Might and Right in the New Millennium. London and Portland, OR: Frank Cass, 1996. Pp.199, select biblio., index. £27.50/$39.50, ISBN 0–714–4624–5.  相似文献   
76.
We consider a periodic review model over a finite horizon for a perishable product with fixed lifetime equal to two review periods. The excess demand in a period is backlogged. The optimal replenishment and demand management (using price) decisions for such a product depend on the relative order of consumption of fresh and old units. We obtain insights on the structure of these decisions when the order of consumption is first‐in, first‐out and last‐in, first‐out. For the FIFO system, we also obtain bounds on both the optimal replenishment quantity as well as expected demand. We compare the FIFO system to two widely analyzed inventory systems that correspond to nonperishable and one‐period lifetime products to understand if demand management would modify our understanding of the relationship among the three systems. In a counterintuitive result, we find that it is more likely that bigger orders are placed in the FIFO system than for a nonperishable product when demand is managed. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
77.
78.
79.
In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
80.
In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ Cj, the makespan Cmax, and the maximum lateness Lmax. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号